Multi-Directory Hashing

نویسندگان

  • Sakti Pramanik
  • Anastasia Analyti
  • Henry Davies
  • Hsiao-Yu Chou
چکیده

We present a new dynamic hashing scheme for disk-based databases, called Multi-Directory Hashing (MDH). MDH uses multiple hash directories to access a file. The size of each hash directory grows dynamically with the file size. The advantages of MDH are enhanced concurrency, improved bucket utilization and smaller total directory size than single-directory hashing. The expected utilization of MDH increases monotonically and approaches 100% as the number of hash directories increases. A variation of MDH, called Main Memory Multi-Directory Hashing (MM-MDH), is also described. MM-MDH achieves optimal search time in main memory databases. The performance of both methods is analyzed through theoretical and experimental results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of a Main Memory Multi-Directory Hashing Technique

Optimal search in main memory databases requires at most one key comparison to locate a record. Extendible hashing becomes impractical when it is adapted to yield optimal search in main memory databases because of its large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over extendible hashing. The objective of this paper is to analyz...

متن کامل

Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme

We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and thus generates a much smaller number of subqueries for query sets (up to now fastgrowing directories have prohibited the use of hash-based index structures for set-valued retrieval). We demonstrate the advantages of o...

متن کامل

Optimized Implementation of Extendible Hashing to Support Large File System Directory

Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper, we present our own specially optimized implementation of using extendible hashing in cluster file system in order to support large directory.

متن کامل

Extendible Hashing

DEFINITION Extendible Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme utilizing a directory. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Extendible Hashing has better expected query cost O(1) I/O. C...

متن کامل

PLOP-Hashing: A Grid File without Directory

In this paper we consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, we suggest piecewise linear expansions in order to distribute the load more evenly over the pages of the file. The resuiting piecewise linear order preserving hashing scheme (PLOP-Hashin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Syst.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1993